Financial Vs Social Sustainability of Telecentres: Mutual Exclusion or Mutual Reinforcement?
نویسندگان
چکیده
منابع مشابه
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کاملMutual exclusion revisited
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come firstserved algorithm immune to various faults. The algorithms are based on a scheme similar to the Morris’s solution of the mutual exclusion with three weak semaphores. The presented algorithms compare favorably with equivalent published mu...
متن کاملFinancial Sustainability Issues in Malaysia's Telecentres
Telecentres plays an important role in bridging digital divide in Malaysia. A study was conducted to identify the issues of financial sustainability on 132 telecentres in Malaysia. The study focused on TCs in four regions of Malaysia Peninsular (northern, central, southern and eastern). Questionnaires were sent to the telecentres’ operators. The results prove that financial support is critical ...
متن کاملMutual Exclusion Scheduling
Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints represented by a graph G, such that tasks represented by adjacent vertices in G must run in disjoint time intervals. This problem arises in load-balancing the parallel solution of partial differential equations by domain decomposition. Minimizing the completion time i...
متن کاملAutomatic Mutual Exclusion
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transactional memory (STM), we arrange that all shared state is implicitly protected unless the programmer explicitly specifies otherwise. An AME program is composed from serializable atomic fragments. We include features all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Information Systems in Developing Countries
سال: 2011
ISSN: 1681-4835
DOI: 10.1002/j.1681-4835.2011.tb00319.x